Benefits of IEEE-754 Features in Modern Symmetric Tridiagonal Eigensolvers

نویسندگان

  • Osni Marques
  • E. Jason Riedy
  • Christof Vömel
چکیده

Bisection is one of the most common methods used to compute the eigenvalues of symmetric tridiagonal matrices. Bisection relies on the Sturm count : for a given shift σ, the number of negative pivots in the factorization T − σI = LDLT equals the number of eigenvalues of T that are smaller than σ. In IEEE-754 arithmetic, the value ∞ permits the computation to continue past a zero pivot, producing a correct Sturm count when T is unreduced. Demmel and Li showed in the 90s that using ∞ rather than testing for zero pivots within the loop could improve performance significantly on certain architectures. When eigenvalues are to be computed to high relative accuracy, it is often preferable to work with LDLT factorizations instead of the original tridiagonal T , see for example the MRRR algorithm. In these cases, the Sturm count has to be computed from LDLT . The differential stationary and progressive qds algorithms are the methods of choice. While it seems trivial to replace T by LDLT , in reality these algorithms are more complicated: in IEEE-754 arithmetic, a zero pivot produces an overflow, followed by an invalid exception (NaN), that renders the Sturm count incorrect. We present alternative, safe formulations that are guaranteed to produce the correct result. Benchmarking these algorithms on a variety of platforms shows that the original formulation without tests is always faster provided no exception occurs. The transforms see speed-ups of up to 2.6× over the careful formulations. Tests on industrial matrices show that encountering exceptions in practice is rare. This leads to the following design: First, compute the Sturm count by the fast but unsafe algorithm. Then, if an exception occurred, recompute the count by a safe, slower alternative. The new Sturm count algorithms improve the speed of bisection by up to 2× on our test matrices. Furthermore, unlike the traditional tiny-pivot substitution, proper use of IEEE-754 features provides a careful formulation that imposes no input range restrictions. AMS subject classifications. 15A18, 15A23.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimizing Locality of Reference in Symmetric Eigensolvers

This paper shows how the symmetric eigenproblem, which is the computationally most demanding part of numerous scientiic and industrial applications, can be solved much more eeciently than by using algorithms currently implemented in Lapack routines. The main techniques used in the algorithm presented in this paper are (i) sophisticated blocking in the tridiagonalization, which leads to a two-sw...

متن کامل

Improved Accuracy and Parallelism for MRRR-based Eigensolvers -- A Mixed Precision Approach

The real symmetric tridiagonal eigenproblem is of outstanding importance in numerical computations; it arises frequently as part of eigensolvers for standard and generalized dense Hermitian eigenproblems that are based on a reduction to tridiagonal form. For its solution, the algorithm of Multiple Relatively Robust Representations (MRRR) is among the fastest methods. Although fast, the solvers ...

متن کامل

An O(N2 ) Method for Computing the Eigensystem of N ˟ N Symmetric Tridiagonal Matrices by the Divide and Conquer Approach

An efficient method to solve the eigenproblem of N x N symmetric tridiagonal matrices is proposed. Unlike the standard eigensolvers that necessitate O(N3) operations to compute the eigenvectors of such matrices, the proposed method computes both the eigenvalues and eigenvectors with only O(N2) operations. The method is based on serial implementation of the recently introduced Divide and Conquer...

متن کامل

MR3-SMP: A symmetric tridiagonal eigensolver for multi-core architectures

The computation of eigenvalues and eigenvectors of symmetric tridiagonal matrices arises frequently in applications; often as one of the steps in the solution of Hermitian and symmetric eigenproblems. While several accurate and efficient methods for the triadiagonal eigenproblem exist, their corresponding implementations usually target uni-processors or large distributed memory systems. Our new...

متن کامل

Parallel solution of partial symmetric eigenvalue problems from electronic structure calculations

The computation of selected eigenvalues and eigenvectors of a symmetric (Hermitian) matrix is an important subtask in many contexts, for example in electronic structure calculations. If a significant portion of the eigensystem is required then typically direct eigensolvers are used. The central three steps are: reduce the matrix to tridiagonal form, compute the eigenpairs of the tridiagonal mat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 28  شماره 

صفحات  -

تاریخ انتشار 2006